perm filename F81.OUT[LET,JMC]1 blob
sn#632534 filedate 1982-01-04 generic text, type C, neo UTF8
COMMENT ⊗ VALID 00052 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00005 00002
C00006 00003 ∂01-Oct-81 1635 JMC
C00007 00004 ∂01-Oct-81 1746 JMC
C00008 00005 ∂02-Oct-81 0054 JMC
C00012 00006 ∂02-Oct-81 0056 JMC
C00013 00007 ∂04-Oct-81 0242 JMC
C00014 00008 ∂04-Oct-81 0243 JMC
C00015 00009 ∂04-Oct-81 1513 JMC lisp
C00016 00010 ∂04-Oct-81 2340 JMC
C00017 00011 ∂05-Oct-81 1917 JMC maps paper
C00018 00012 ∂05-Oct-81 2322 JMC
C00019 00013 ∂08-Oct-81 0119 JMC
C00020 00014 ∂08-Oct-81 1258 JMC revision of list
C00022 00015 ∂08-Oct-81 1742 JMC proving non-knowledge
C00025 00016 ∂10-Oct-81 0230 JMC one way to the moon
C00026 00017 ∂10-Oct-81 1330 JMC
C00028 00018 ∂10-Oct-81 1927 JMC S-1 usage
C00029 00019 ∂11-Oct-81 0030 JMC LLL use of SAIL
C00030 00020 ∂11-Oct-81 0207 JMC colonization
C00031 00021 ∂12-Oct-81 0000 JMC
C00032 00022 ∂12-Oct-81 0109 JMC
C00033 00023 ∂12-Oct-81 0142 JMC
C00034 00024 ∂12-Oct-81 0244 JMC
C00035 00025 ∂12-Oct-81 1034 JMC
C00036 00026 ∂12-Oct-81 1037 JMC
C00037 00027 ∂12-Oct-81 1041 JMC
C00038 00028 ∂12-Oct-81 1049 JMC seminar
C00039 00029 ∂12-Oct-81 1105 JMC Russell
C00040 00030 ∂13-Oct-81 1626 JMC
C00041 00031 ∂13-Oct-81 2318 JMC
C00042 00032 ∂14-Oct-81 0209 JMC
C00043 00033 ∂14-Oct-81 0229 JMC drec
C00044 00034 ∂14-Oct-81 0231 JMC
C00045 00035 ∂14-Oct-81 0231 JMC
C00046 00036 ∂14-Oct-81 0231 JMC
C00047 00037 ∂15-Oct-81 0027 JMC
C00048 00038 ∂15-Oct-81 1533 JMC
C00049 00039 ∂15-Oct-81 1609 JMC Stanford interest in acquiring S-1
C00051 00040 ∂15-Oct-81 1628 JMC Centaur
C00054 00041 ∂15-Oct-81 1827 JMC thesis proposal
C00055 00042 ∂15-Oct-81 1836 JMC Montague and Boolos
C00056 00043 ∂15-Oct-81 1852 JMC cs206 assignment
C00057 00044 ∂15-Oct-81 2151 JMC
C00058 00045 ∂15-Oct-81 2231 JMC
C00059 00046 ∂16-Oct-81 1140 JMC
C00060 00047 ∂16-Oct-81 2208 JMC Chandrasekaran at Ohio State
C00061 00048 ∂16-Oct-81 2224 JMC comparison
C00062 00049 ∂16-Oct-81 2233 JMC
C00063 00050 ∂16-Oct-81 2308 JMC Russian interest in American image processing
C00065 00051 ∂16-Oct-81 2310 JMC
C00066 00052 ∂16-Oct-81 2319 JMC
C00067 ENDMK
C⊗;
∂01-Oct-81 1635 JMC
To: csd.tajnai at SU-SCORE
What file is the current reading list for MTC? I have forgotten what
I wanted to add, and I think it will remind me.
∂01-Oct-81 1746 JMC
To: aaai-office at SUMEX-AIM
It may be a while before I get around to picking up my ijcai proceedings.
∂02-Oct-81 0054 JMC
To: pourne at MIT-MC
CC: LLW at SU-AI
pourne[f81,jmc] Note to Jerry about report
Inevitably, much of what the second meeting had to do was to
repeat points raised at the first meeting. It seems to me that there
are two points that should be emphasized in the report.
1. The anti-tank crowbar system has potential to give the
President non-nuclear alternatives in some situation where he
would otherwise have to use the neutron bomb. The extent to which
this should be emphasized probably depends on the degree of optimism
of the DARPA sponsors of the research. Lowell could probably tell
you about that.
In a psychological environment
in which men of vision and good will are looking for justifications
for space activities, it may be an important point.
2. I think we should suggest that the President announce that
our astronaut programs will accept a limited number of foreigners
who meet qualifications for trainees. The foreign man in the street,
even in poor Asian countries, was much more impressed and interested
by the Shuttle and Voyager than by any amount of communication satellites
for education and earth resources surveys. The Indian student has
as much imagination as an American, and is just as inclined to be
fascinated by space, even though the sober types think he ought
rather to be interested in stamping out illiteracy.
The possibility of becoming an astronaut, even if he is one of the
999 out of 1000 who never seriously considers applying, can be more
inspiring to a young man of the third world
than the possibility of being a Marxist revolutionary.
The great interest in the Shuttle and Voyager, the spectaculars
that extend the possibilities of humanity as compared to the
narrow material benefits of Landsat, etc. was confirmed to me
by an American sitting next to me on the plane to Europe. He
described the excitement in Singapore and the congratulations
he received as an American at the time of the Shuttle landing.
However, we should admit foreigners as individuals in the
American way rather than as representatives of their governments
in the Soviet way. The President should consider announcing
this at Cancun. Applications would be accepted directly from
individuals rather than through governments.
∂02-Oct-81 0056 JMC
To: csd.ullman at SU-SCORE
Alas, I'll miss the facilities meeting again.
∂04-Oct-81 0242 JMC
To: FFL
kowals.1
∂04-Oct-81 0243 JMC
To: FFL
There may be a better address for Kowalski in Q. Mary address list.
∂04-Oct-81 1513 JMC lisp
To: RPG
I will be available tomorrow afternoon and also Tuesday at 4:15 for
Feigenbaum's meeting. How many LISP users did you count in the
Formal Reasoning Group?
∂04-Oct-81 2340 JMC
To: feigenbaum at SUMEX-AIM
I'll come Tuesday.
∂05-Oct-81 1917 JMC maps paper
To: FFL
Please put the file maps[e81,jmc] into SCRIBE form. I have put the
variables (non word single letters or short strings) into italics
in the later part of the paper, but this needs to be done in the
earlier part. I will supply the references and ask you to put them
in SCRIBE form.
∂05-Oct-81 2322 JMC
To: JMM
Please phone them and ask if 50 are available. Say that the number may be
more than 50 and ask how many are available. Verify price and ask if they
could ship airfreight if prepaid.
∂08-Oct-81 0119 JMC
To: REG
Let's talk Friday after EQUIP meeting about CSCF budget.
∂08-Oct-81 1258 JMC revision of list
To: equip at DIABLO
I advocate putting the "foonly" in the first year. The file crunch is
now, we can get the foonly as soon as we get the money, and if we delay,
there will have to be ad hoc expensive solutions to the file crunch.
Putting McSun in the second year is acceptable as far as ARPA money is
concerned, provided we can use some of the Department's Stauffer money
to get started sooner. I intend to explore the possiblity of convincing
the Navy that having an S-1 in a major university is worth partial or
total subsidy. I also will follow up on hints that remote use of the
S-1 complex at Livermore may be feasible and useful for both big LISP
and big numerical problems.
∂08-Oct-81 1742 JMC proving non-knowledge
To: RWW, JK
Here is an example where we want to prove non-knowledge where the
proof theory of natural deduction systems is relevant and where
some formalized metatheory may be relevant. The problem is a
simplified version of one which occurs in the S and P problem,
but I believe it contains the essence of the matter.
We have a certain number N, say the number of peas in a jar. A person
P is told nothing, but he can do arithmetic. We want to show that
Mr. P. does not know that N is not 52. We might write this
k(P,"N ≠ 52").
Suppose that, contrary to Goedel, Mr. P knows that his knowledge is
consistent. He would then reason as follows. Suppose I could prove
from no assumptions the statement N≠52. Then I would be able to
use universal generalization and write ∀N.(N≠52). This just depends
on my having introduced no assumption in which N occurs free. But
then I could substitute 52 for N and get 52≠52 a contradiction. Since
my reasoning system is consistent, this can't be, and so I can conclude
that I don't know that N≠52.
We propose to get out of the Goedel theorem difficulty by providing
Mr. P with a hierarchy of knowledge operators. They will satisfy
the following variant of Montague's inconsistent knowledge axioms.
K(P,n,p) ⊃ p
K(P,n+1,K(P,n,p) ⊃ p)
K(P,n,p) ∧ I(p,q) ⊃ K(P,n,q).
The contradiction is avoided by the hierarchy of operators. This
is akin to Montague's suggestion of a hierarch of languages but
more practical. Essentially each level of knowledge contains the
additional assumption that the lower levels are sound (including
consistent).
The key question from the point of view of formalizing the metamathematics
is the using the fact that there are no assumptions in which N
occurs free in order to justify the universal generalization.
∂10-Oct-81 0230 JMC one way to the moon
To: "@SHACKL.LIS[F81,JMC]" at SU-AI
The file SHACKL[F81,JMC] at SU-AI contains preliminary writeups of
our discussion at Pournelle's meeting. The last page is the most
coherent writeup. The previous pages represent various starts, but
some of the material in them has not been incorporated in the
last page. Moreover, they represent alternative styles.
When numbers were wanted, they were invented ruthlessly. Proposals
for more plausible numbers are needed for the next draft. Before
proceeding further, I think we need expressions of continued interest
from ourselves.
∂10-Oct-81 1330 JMC
To: REG at SU-AI, DPB at SU-AI, ARK at SU-AI
I think the contacts with the S-1 people are valuable for Stanford,
and we should continue the S-1 users assuming they pay for their
level of use. The implication in ARK's message that the S-1 people
have somehow behaved discourteously in deciding to set up their
own WAITS rather than pay our prices is incorrect. Whether they
made an optimal decision or not is their affair. What it tells us
is that usage is more price sensitive than we might have assumed
and that CSD-CF must run a more economical operation. Not everyone
requires a large staff to run a time-sharing system, and those brave
enough to ¬{e Foonlys instead of DEC-20s seem to be rewarded by
fortune. Context should also take warning from this.
∂10-Oct-81 1927 JMC S-1 usage
To: ARK at SU-AI, DPB at SU-AI, REG at SU-AI
If, as ARK contends, the SAIL charging system permits the S-1 people
to pay nothing, then the system should be changed for all - not just
for them. I would suppose that they would take the view that since
the previous system overcharged them, and I believe it did, and their
protests were ignored, it is only rational for them to take advantage
of the rules when they work in their favor.
∂11-Oct-81 0030 JMC LLL use of SAIL
To: ARK at SU-AI, REG at SU-AI, DPB at SU-AI
I talked to Lowell Wood, and he told me about various accounts
they are keeping here with substantial quotas. They believe they
are paying for what they will be using. Perhaps there will later
be some reason to re-evaluate their estimates, but there is no
present reason to suppose we are being mistreated.
∂11-Oct-81 0207 JMC colonization
To: rah at S1-A
I expect to come to Livermore Wednesday. Will you have time to talk
then. If so, I'll phone when I get in.
∂12-Oct-81 0000 JMC
To: rwg at MIT-MC
Is Richard up?
∂12-Oct-81 0109 JMC
To: ROY, REG
Please either fix my Imlac or remove it.
∂12-Oct-81 0142 JMC
To: JJW
I fixed spelling of Weyhrauch but had to unprotect eklman.tex.
∂12-Oct-81 0244 JMC
To: nilsson at SRI-AI
Welcome back. I need to discuss CBCL project with you.
∂12-Oct-81 1034 JMC
To: nilsson at SRI-AI
Any time Friday afternoon would be fine. Let me suggest 1:30 for
definiteness. It would be good if Stan were there too.
∂12-Oct-81 1037 JMC
To: LGC
I don't know if I'll be in before going to lunch with Castaneda.
∂12-Oct-81 1041 JMC
To: REG
I think you should prepare a proposed revised budget.
∂12-Oct-81 1049 JMC seminar
To: "@PROVE.LIS[F81,JMC]"
Starting Tuesday Oct 12 at 3pm, there will be a seminar on
proving properties of programs in EKL and/or FOL. We need to
develop our technique, extend the class of properties that
can be proved, recommend improvements in the provers and
develop an environment of axioms for CS206 and CS258.
∂12-Oct-81 1105 JMC Russell
To: FFL
I phoned and accepted his invitation and date. Please send him
a copy of "An Unreasonable Book". If it isn't in my file with
other papers, then it can be pubbed and printed from WEIZEN[W76,JMC].
∂13-Oct-81 1626 JMC
To: RWW
%3Cartwright, Robert and John McCarthy (1979)%1:
"Recursive Programs as Functions in a First Order Theory",
in %2Proceedings of the International Conference on Mathematical Studies of
Information Processing%1, Kyoto, Japan.
.<<aim 324, FIRST.NEW[W77,JMC]>>
for minimization schema
%3McCarthy, John (1963)%1: "Towards a Mathematical Theory of Computation",
in Proc. IFIP Congress 62, North-Holland, Amsterdam.
for abstract syntax
I don't think the 91-function is mentioned in a published paper, although
I'm not sure.
∂13-Oct-81 2318 JMC
To: rah at S1-A
4 will be fine or dinner and beyond
∂14-Oct-81 0209 JMC
To: pourne at MIT-MC
All the suggestions you have made are worth thinking about. Rod Hyde
and Danny Hilles are gathering facts relevant to a cost estimate at
the moment. My intuition says that publicity should be timed for
when it can do the most good. We may have a better estimate in a
few days or weeks. We'll keep you informed.
∂14-Oct-81 0229 JMC drec
To: JK
I have put a copy of cycle.lsp which contains an attempt to
use drec as discussed in the seminar today. I haven't tried to
figure out whether the last stuff is correct or wanted.
I be back Thursday.
∂14-Oct-81 0231 JMC
To: FFL
I'll be at Livermore today.
∂14-Oct-81 0231 JMC
To: JK
I have put it on your door.
∂14-Oct-81 0231 JMC
To: CLT
Consider cycle.lsp[f81,jmc].
∂15-Oct-81 0027 JMC
To: JK
Ignore cycle.lsp.
∂15-Oct-81 1533 JMC
To: DPB at SU-AI
I will talk on 11/5 in CS200 if it's still open.
∂15-Oct-81 1609 JMC Stanford interest in acquiring S-1
To: llw at S1-A
CC: JEO at SU-AI
I am not sure Stanford will be able to come up with $650K for an S-1
without some help. It would be worthwhile to ask whether the Navy
would want to have an S-1 in a major academic center like Stanford.
An additional factor is that Joe Oliger, who works on numerical
analysis of hydrodynamics, would very much like to be able to use
a machine of the power of the S-1. His work is funded by the Navy,
at least in part. My own interest, as you know, is to be able to
use the large memory of the S-1 for large LISP problems.
We are also both interested in the possibility of interim use of
and S-1 located at Livermore over the net.
∂15-Oct-81 1628 JMC Centaur
To: rah at S1-A
CC: llw at S1-A, pourne at MIT-MC
It occurs to me that if the Centaur is being planned as a ferry
between LEO and Geosync, then it may be cheaper to try to use it
differently than as an expendable vehicle. Namely, it should be able
to make a lunar flyby, which I suppose doesn't require much more energy
that going to Geosync and returning to LEO. The idea would be to launch
our payload from a lunar flyby. Alternatively, the Centaur might
establish lunar orbit, release our payload and return.
Can you determine whether these are reasonable possibilities and what
mass they would permit placing on the moon?
It occurs to me that if we determined that this was a good way to accomplish
our mission, it might serve as an underground reason for Air Force support
of Centaur by people who would like to see our mission done. It might
encourage them to interpret other reasons for doing the Centaur more
favorably.
Aside to Pournelle: I have had manuals Essential E and Short Waits sent.
Also, Rod has informed me that we were overoptimistic about what a single
Shuttle launch could place on the moon. With the Centaur engine, he
gets 7.5 tonnes and with a nitrogen tetroxide engine, as in the LEM,
2.5 tonnes.
∂15-Oct-81 1827 JMC thesis proposal
To: konolige at SRI-AI
Thanks for it. I think there are some conceptual questions that should
be clarified promptly. Who are the other members of your committee, or
is it formed yet? My idea is to get them to help me in getting you
to formulate the questions sharply.
∂15-Oct-81 1836 JMC Montague and Boolos
To: konolige at SRI-AI
You should also know about Montague's "Syntactic treatments of modality"
and Boolos's "The unprovability of consistency". I want to get you to
look into some ideas I have about how Montague's inconsistent set of
axioms can be fixed. Many of the same issues arise whether modal logic
is used or whether a purely syntactic treatment is used.
∂15-Oct-81 1852 JMC cs206 assignment
To: JMM
The assignment consist of problems from chapter 2. In one week they are
to do 1, 3,4,5,6,7,11, and 12. In two weeks they are two also do
13,19,27,28, and 29-33.
∂15-Oct-81 2151 JMC
To: FFL
Did I receive an envelope perhaps 2 weeks ago from Edward Teller?
∂15-Oct-81 2231 JMC
To: CG
If you don't need your Alto aliquots, we should cancel them.
∂16-Oct-81 1140 JMC
To: csd.bscott at SU-SCORE
Permission confirmed - John
John, would you please confirm permission to send your salary rate to
LLL.
∂16-Oct-81 2208 JMC Chandrasekaran at Ohio State
To: shortliffe at SUMEX-AIM
Do you know of his work on a system called MDX for diagnosing
cholestasis? Is his work considered good in the medical AI
field? I have been asked to look at a proposal for work in
helping operators of nuclear power plants diagnose possible
emergency conditions.
∂16-Oct-81 2224 JMC comparison
To: RPG
I didn't know SAIL was slower than 2060 for LISP. Perhaps we should
try SCORE on the Takeuchi example for comparison.
∂16-Oct-81 2233 JMC
To: RPG
I assume this was MACLISP on SCORE?
∂16-Oct-81 2308 JMC Russian interest in American image processing
To: TOB
The news story CODE.NS[F81,JMC] treats, among other matters, Russian
efforts to steal image processing technology in this area. I think
we should make sure that our reports on vision and robotics are not
sent to East bloc addresses. If there were no better reason, it
is likely to cause us trouble. One mechanism would be to annunce
the reports as CS reports, but include in the announcement that
the reports are available only directly from your group. Certain
requests could then be ignored. Requests for published papers
should almost certainly be honored, however, since the Russians
can get them anyway, and also their information filter occurs
when something is proposed for publication. During the whole
of our acquaintance, Ershov never sent me anything unpublished,
although in good years, he did some rather local, though still
censored, publication.
∂16-Oct-81 2310 JMC
To: SIS
That's Jack Schwartz, I believe. (spelling of last name).
∂16-Oct-81 2319 JMC
To: SL
When is Tom expected back?
∂17-Oct-81 0044 JMC
To: llw at S1-A
I entirely agree with your last. In fact my reply to Pournelle's message
was the following paragraph. Would you like to add weight to it by one of
your own, suggesting that the project be entirely kept out of the press or
official circles or even any organization that might prematurely formulate
an attitude? The other possibility is to let well enough alone if you
think Jerry can't help talking. I have no evidence on that point one way
or the other.
All the suggestions you have made are worth thinking about. Rod Hyde
and Danny Hilles are gathering facts relevant to a cost estimate at
the moment. My intuition says that publicity should be timed for
when it can do the most good. We may have a better estimate in a
few days or weeks. We'll keep you informed.
∂17-Oct-81 1220 JMC
To: JEF at SU-AI
∂17-Oct-81 2028 JMC problem with ekl
To: JK
I'm not sure whether it's my problem or yours. CYCLE.PRF[F81,JMC] contains
the proof in question. My object was to rewrite so as to eliminate the
occurrence of drec and so obtain the recursion equation for append. Why
doesn't the last step work?
∂17-Oct-81 2341 JMC
To: energy at MIT-MC
REM: "We'll last longer if we tap the Sun's output rather than burn
Earth's hydrogen."
Remark: The times are so long (billions of years) in either case
that there is no serious point for the next million years.
Our descendants will have only an antiquarian interest in
what we imagine they ought to do. Who knows anything about
what people even 200 years ago thought the future would be like
and what problems would be faced.
To Salamin: Shippingport was not built as a breeder. It is was an
ordinary pressurized water reactor for (ten?) years and was then closed down.
In the middle 70s it was rebuilt as a light water breeder by
Rickover. What success he has had, he keeps to himself.
∂18-Oct-81 0040 JMC Takeuchi
To: VRP at SU-AI
CC: RPG at SU-AI
I proposed Takeuchi only because it's easy to program and can
readily be made to take any convenient time and because Takeuchi
had already used it as a benchmark. I suppose Takeuchi himself used
others also. It tests recursive subroutine calling almost
exclusively, and that is one thing one would like to know about.
Cons intensive benchmarks are also interesting.
∂18-Oct-81 2257 JMC your latest message
To: RPG
Any comments on Chandrasekar proposal?
∂18-Oct-81 2358 JMC
To: RPG
Many thanks. I await tomorrow.
∂19-Oct-81 1207 JMC
To: engelmore at SUMEX-AIM
Thanks Bob.
∂19-Oct-81 1909 JMC Allen and Schwartz
To: GHG at SU-AI
Carolyn and I would like to invite them to dinner Friday night. Do you
know if they will be free? We would have it at Louie's; they are known
to like Chinese food, and the expedition could be arbitrarily expanded.
I am available any time Friday to talk with them, but if our invitation
works out, after Jack's lecture might be best.
∂20-Oct-81 1546 JMC
To: GHG at SU-AI
Fine. We'll plan for it then.
∂20-Oct-81 2147 JMC
To: llw at S1-A
Stanford received $79.1 million in gifts last year - an ordinary year.
∂20-Oct-81 2343 JMC
To: JK
we need to prepare a proposal for your continued support.
∂21-Oct-81 0240 JMC
To: FFL
SHUBIK.1[LET,JMC]
∂21-Oct-81 0248 JMC
To: FFL
kowals.2. See his letter for date and address.
∂21-Oct-81 0258 JMC
To: FFL
porto.1 and pereir.3
∂21-Oct-81 2153 JMC Schwartz talk and dinner at Louie's
To: pmf at S1-A, jbr at S1-A, tm at S1-A
Prof. Jack Schwartz of NYU will talk at 3:15 on Friday in Wiederhold's
database seminar on "ultra-computers". There will be a dinner for him
and Fran Allen Friday at Louie's at 7pm for whoever would like to come
but let me know asap.
∂21-Oct-81 2156 JMC imlac sizzling
To: ROY
The Imlac is making sizzling noises. Now I recall that it did this
before it died before.
I'll keep you informed.
∂21-Oct-81 2202 JMC meeting
To: REG at SU-AI, LB at SU-AI
CC: GHG at SU-AI
Can you meet tomorrow or Friday about CSCF budget? Do you have an
estimate of what is the actual potential income given that direct
costs are quite a bit less than the total budget of a project?
I would guess they run 55 to 60 percent of the total budget.
∂21-Oct-81 2208 JMC
To: ROY
Just lost almost all vertical deflection. It came back and went again.
∂21-Oct-81 2209 JMC more on imlac
To: ROY
The program then stopped. Starting the Imlac again restarted the
program so that I could send a test message, but the screen didn't
come back.
∂21-Oct-81 2353 JMC
To: ROY
Maybe some of the fans aren't working.
∂22-Oct-81 0034 JMC
To: konolige at SRI-AI
knowle[f81,jmc] writes up some of what I told you.
∂22-Oct-81 1143 JMC
To: "@PROVE.LIS[F81,JMC]"
Meeting 4pm today on proving facts about LISP programs.
∂22-Oct-81 2132 JMC equipment
To: mogul at DIABLO
I would like to discuss your views with you as soon as possible. A meeting
of principal investigators for the DARPA proposal will be held Monday, so
it would be well to meet before then.
∂23-Oct-81 1222 JMC
To: mogul at DIABLO
1. I agree about the main problem being lack of file space, and it was
the unanimous consensus that it should be in the first year's DARPA budget.
The Foonly is the prime candidate (no need to make a final decision
until the money is in our hands) mainly for the reasons that caused you
to advocate the VAX. D.E.C. has no current plan to offer large disks
on the VAX (we wrote to Gordon Bell about the file server problem and
got no sympathy), and the Foonly now offers inexpensive CDC 670 megabyte
disks, and we plan to get them to promise to interface the cheap
imitations of the IBM 3380 thin head disks when they appear. Foonly
also offers the Ethernet interface at no extra cost.
2. I also agree that terminals for everyone is the second major problem
for the Department. For this reason I have been pushing the inexpensive
terminal based on the SUN boards. However, DARPA cannot accept supplying
the whole department with terminals as one of its goals, so that can't
be included in the proposal. On the other hand, there is $150,000 in
a grant from the Stauffer Foundation that has been earmarked for this
purpose for some years. We would have them by now if the SUN project
hadn't stalled of an outside purchase by claiming that the SUN board
would be directly useful for the purpose and also misstating when it
would be available.
3. DARPA has (by law) to take the position that the equipment it supplies
are for the benefit of the research it sponsors, but it is inclined
to take an expansive view of the extent to which its interests are
advanced by making the equipment it provides available to potential
DARPA sponsored researchers. What this amounts to is that we can
get a big head start on equipment with DARPA aid but must find at least
some other money.
4. Getting more time-shared cycles is being postponed, because there
is no available machine a lot better than what we have. Anyway something
has to be left out of the first year's budget. We will be able to
look at the 2080 and the S-1 before having to decide. Foonly
doesn't offer a machine much faster than the 2060, and 18 bit addresses
aren't acceptable anyway.
5. In general I am not an enthusiast for personal machines in terminal
rooms. I will want one when it will fit on my desk and not require a
fan. However, personal machines seem to be the idea whose time has come.
6.There is a very serious problem of financing the current computer
complex quite apart from that of supporting new machines.
7. Did you receive my previous message. There seems to have been some
problem with messages.
∂23-Oct-81 1242 JMC
To: mogul at DIABLO
2:15 will be fine.
∂23-Oct-81 1453 JMC mistake
To: FFL
Bob Russell reports that he has only the even numbered pages of
the review of Weizenbaum. I mentioned the existence of the report
with three reviews, and he would like it.
∂23-Oct-81 2024 JMC
To: csd.genesereth at SU-SCORE
Thanks for your comments on the Chandrasekaran proposal.
∂25-Oct-81 0119 JMC ftp problem
To: ME
I tried to ftp the files on ess,jmc to the corresponding directory at
S-1. I tried (from the S-1) both
get *.*[ess,jmc]
and
get *.ess[ess,jmc]
In both cases I got a message referring to a specific file (which turned
out to be one of those in ess,jmc) saying that the file in question in
NET,GUE wasn't found and that NET,GUE didn't exist. Dired shows nothing
about net,gue in connection with these files. Remember that NET,GUE was
a long ago deleted directory for network guests. What is its ghost doing
here now?
∂25-Oct-81 0123 JMC p.s. on ftp problem
To: ME
In both cases nothing was transferred.
∂25-Oct-81 0150 JMC p.p.s on ftp problem
To: ME
It seems that whenever I try
get *.baz
or
get foo.*
it complains about nonexistence of [NET,GUE] even when
foo.baz
exists, is newly created, and is the only file beginning with foo
or ending with baz.
∂26-Oct-81 0028 JMC
To: admin.library at SU-SCORE
To Harry or Richard:
Can you advise me as to how to obtain the following NASA reports?
I would like both hard copy and fiche if both are available but will
take whichever is available. I can pay costs. I assume the best local
source is Ames. Do you know whom to talk to there? I could go there
on Tuesday or Wednesday.
This fiche is listed in order of importance ( best is first ), and
by NASA acession number, which is how Ames will access it.
N70-17551 : Cargo vehicle using the RL10 engine.
N79-32225 thru N79-32229 : These are part of a large report, SP-428, on
space habitats. It was done as a summer study at Ames, so
they may have a hard copy also. If so try to get both, with
priority on fiche.
N65-16672 : Baseline RL10 specs.
N76-26830,26831,26832,26836,26838,26839 : These are life support papers
which are part of a larger report SP-374 Vol 3. The entire
report starts at fiche N76-26829. It is combo of Russian &
US stuff.
N62-13348 : One way lunar mission.
N78-26740 : Mathematical treatment of closed life support systems.
N80-12735 thru N80-12738 : Guidelines for life support design.
∂26-Oct-81 1253 JMC
To: FFL
moses.1. This is in reply to a request for a letter about Winston.
∂27-Oct-81 0042 JMC
To: RPG
Where do we currently stand on Prolog for SAIL?
∂27-Oct-81 1206 JMC
To: FFL
DAVIS.REV[F81,JMC] should be transcribed to the NSF form.
∂27-Oct-81 1609 JMC
To: RPG
The sources should go in 1,3 or whereever other language sources are kept.
∂27-Oct-81 1620 JMC
To: rah at S1-A, llw at S1-A
I have SP428 and SP374.
∂27-Oct-81 1634 JMC
To: RPG
Well then, create a new file area and propose that it be treated like
LISP and SAIL, i.e. as a system overhead. If someone balks at this,
then I'll guarantee from DARPA money that it is paid for and will argue
later.
∂27-Oct-81 2157 JMC
To: pmf at S1-A
What did you think of Schwartz's talk and their scheme?
∂28-Oct-81 1057 JMC
To: csd.ullman at SU-SCORE
I think the budget is ready for distribution.
∂29-Oct-81 1154 JMC your usage
To: RPG at SU-AI
CC: GIO at SU-AI
Please estimate the fractions of your usage that are:
a. general maintenance of MACLSIP - an overhead of SAIL
b. chargable to the work you are doing for Livermore. Does
all present Livermore work go through Gio's contract?
c. chargable to the formal reasoning group
All your usage should be charged to one of these three, and it is
just a question of dividing up the aliquots.
∂30-Oct-81 0432 JMC chandr.re1
To: FFL
This is a memo to Edward Teller. In a couple places I tried to use italics
but I think I got the notation wrong.
∂30-Oct-81 1225 JMC
To: FFL
I decided to lecture at Kent State. They say there is a 1:50 pm flight
on Sunday that gets me to Cleveland at 9:10 pm. That would be suitable.
I would go from Akron-Kent airport to Pittsburgh at 6:10 pm. Please
make reservations accordingly.
∂30-Oct-81 1226 JMC
To: FFL
examin.2
∂30-Oct-81 1320 JMC
To: RPG
∂28-Oct-81 0901 ullman@Diablo (SuNet)
Date: 28 Oct 1981 08:53:23-PST
From: ullman at Diablo
To: csl.jlh@score, engelmore@sumex, jmc@sail
What follows is the tentative proposal formulated by
representatives of the three major areas of ARPA activity,
Bob Engelmore, John Hennessy, and John McCarthy, meeting
with me. The budget is under 3 million, and includes a
small amount for maintenence. The assumption is that once
our ARPA proposals have a chance to adjust to the costs of
the new equipment, maintenence will be covered by the con-
tracts of those who use the equipment. The major changes
are:
1. The cost of the ethernet was raised by 200K, to reflect
our discovery that such development was seriously
affecting the cost of CSD-CF service and that we cannot
continue to operate this way. Most of this extra money
will go for development of the facility, rather than
equipment per se.
2. The amount devoted to purchase of SUN terminals was
reduced to cover only the 25 requested by the systems
group and 10 more for the general use of the other con-
tractors. We felt that there was no way we could jus-
tify more as being ARPA-related.
3. We have budgeted only half the estimated cost of an S-
1. It is hoped that this amount will cover the cost of
that portion of the beast earmarked for LISP cycles,
with the balance supported in one of a number of ways
and intended for general, probably non-ARPA, work.
4. We included the cost of all 8 Gbytes of storage in the
file server.
1982 1983 1984 HPP SAIL SYST GENL
VAX 250 250
S1 325 325
"Dolphins" 480 420 720 180
SUN 200 70 200 70
McSUN 100 100
Foonly 225 125 350
Ethernet 100 100 100 300
ERL Local Net 30 30 60
Printers 30 60 30 30 60 30
Local file stores 50 50 100
SUVAXen 180 180
Maintenence 45 15 5 10 15
TOTALS 1090 960 950 765 510 760 965
GRAND TOTAL = $3,000,000
October 27, 1981
I think the budget is ready for distribution.
∂30-Oct-81 1356 JMC
To: RPG, LGC, JK, CG, CLT, JMM, RWW, JJW, YOM
EQUIP[F81,JMC] is a draft for inclusion in equipment proposal.
∂30-Oct-81 1406 JMC
To: RPG, LGC, JK, CG, CLT
We have to make some promises about deliverables.
E.g. EKL manual and associated report, report on CG's vision work perhaps
with a program.
Interim report on Advice Taker.
Let me know your ideas, preferably in the form of sentences.
∂28-Oct-81 1341 Bob Engelmore <CSD.ENGELMORE at SU-SCORE> Deliverables on ARPA contract
Date: 28 Oct 1981 1338-PST
From: Bob Engelmore <CSD.ENGELMORE at SU-SCORE>
Subject: Deliverables on ARPA contract
To: JMC at SU-AI, DCL at SU-AI, TOB at SU-AI, ZM at SU-AI,
Wiederhold at SUMEX-AIM
cc: csd.bscott at SU-SCORE, Waldinger at SRI-KL
John Machado (the contract monitor) called me today and asked that I
coordinate the following with you. It seems that the statement of work
for your new ARPA contract contains no deliverables, and without any
he can't proceed further. A deliverable would be an interim technical
report on a specific topic, or a documented program that could be
distributed to and used by others. There should be from 1 to 4 deliver-
able items per task (i.e. per principal investigator in this case).
Each item should have a delivery date associated with it -- be very
conservative with these dates, as I suspect Machado will hold you to
them pretty strictly.
It should be relatively easy to generate a list of deliverables from
the text of your proposal, but each of you should do it as soon as
possible. It might be best if you sent the list to me and I'll
package them into one note to Machado.
Bob
-------
∂30-Oct-81 2052 JMC Discussing Shackleton with Cannon
To: llw at S1-A
I would like to discuss Shackleton with Bob Cannon, chairman of the
Stanford Aeronautics and Astronautics Department. He and I have
collaborated in trying to promote robotics at Stanford, and both
Marvin and Jerry P. also have a high opinion of him.
∂01-Nov-81 1740 JMC
To: REM
It wasn't me who sent the message.
∂02-Nov-81 1527 JMC grader for cs206
To: DPB at SU-AI
There are 80 in CS206. Can the department pay for a grader as
well as the TA? Can the department find a grader?
∂02-Nov-81 1601 JMC Re: grader for cs206
To: JMM
∂02-Nov-81 1559 Denny Brown <CSD.DBROWN at SU-SCORE> Re: grader for cs206
Date: 2 Nov 1981 1554-PST
From: Denny Brown <CSD.DBROWN at SU-SCORE>
Stanford-Phone: (415) 497-2274
Subject: Re: grader for cs206
To: JMC at SU-AI, DPB at SU-AI
In-Reply-To: Your message of 2-Nov-81 1527-PST
Yes, we can pay. Finding the body is not necessarily easy. I assume that
your current TA is 1/2 time. We can go to 1/4 time grader or (equiv.) 10
hrs per week. I suggest your TA announce it on the Bbds and do some word
of mouth. I have nobody who is looking for money and capable of 206.
-Denny
-------
∂03-Nov-81 1158 JMC reports
To: rah at S1-A, llw at S1-A, danny at MIT-AI
I now have three more in fiche,
"Guiding the development of a controlled ..."
"Space ecosynthesis ...
"Lunar logistics vehicle"
This leaves only N62-13348: "One way lunar mission", which the librarians
are trying to get NTIS having failed at Stanford and Ames.
∂03-Nov-81 1258 JMC
To: FFL
Please call Ann Mayo 7-3056 and tell her I'll chair the oral
∂03-Nov-81 1537 JMC deliverables
To: csd.engelmore at SU-SCORE
March 1982
Report on Chris Goad's new method of hidden line and hidden surface
elimination
May 1982,
Report containing manual for the EKL interactive theorem prover by
Jussi Ketonen and Joe Weening
October 1982
Report on formalisms for representing knowledge about knowledge
by John McCarthy
∂03-Nov-81 2048 JMC
To: DPB at SU-AI
Thanks Denny. Had you not reminded me, I would have gone to the
tenured faculty meeting.
∂04-Nov-81 0157 JMC
To: JMC
PROJ.F80[F80,JMC] Possible 206 projects
∂04-Nov-81 1335 JMC
To: HGC
Tomorrow's homework should have informal proofs.
∂04-Nov-81 1348 JMC sail charges for maclisp maintenance
To: RPG at SU-AI, csd.hill at SU-SCORE, FFL at SU-AI
CC: REG at SU-AI
It was agreed between jmc and reg that a separate account for this
purpose should be created, and rpg's activities in maintaining
maclisp should be charged to it.
∂04-Nov-81 1401 JMC
To: RPG
Now that the principle is settled, please arrange details with Ralph and Susan.
∂04-Nov-81 1604 JMC
To: FFL
guzman.1
∂04-Nov-81 1607 JMC
To: FFL
stoyan.6
∂05-Nov-81 1712 JMC KA-10 as file server
To: equip at DIABLO
The KA-10 has the right speed for a file server, but is not suitable,
because an interface to modern disks would have to be constructed.
I only respond to a suggestion that might not have been seriously
intended so as to underline the requirement that as little as possible
have to be designed, built and maintained.
∂05-Nov-81 2159 JMC
To: ME
Can it really take almost six seconds to finger a person who is logged in?
∂06-Nov-81 0138 JMC (list x y ... z)
To: JK
Is there any convenient way of declaring and axiomatizing the properties
of the lisp list function? Note that it isn't associative. Currently
I am using list1(x) and list2(x,y).
∂06-Nov-81 0221 JMC obscure error message
To: JK
Consider lispax.lsp[e81,jmc]. Page 2 gives the axioms, and ekl liked
all but the last 3 and complained as shown at the end of page 3. It is
obscure to me and will be obscure to others what it didn't like.
Presumably it was something about the use of the infix *. Please consider
both my immediate problem of getting ekl to accept these axioms and the
long term problem of making the syntax error messages more informative.
Apparently the problem of making parsers give informative error messages
isn't easy to solve.
∂06-Nov-81 0838 JMC
To: JK
I guess that after I have defined list(x,...,z) my problem will be
to write the axiom
list(x,y,...,z) = cons(x,list(y,...,z)).
Thanks for the answer on binding power.
∂06-Nov-81 1207 JMC
To: JK
Suppose I declare the function list(x,...,z) as you mention in your
previous message. Will I have any problems with separate axioms
for the first few lengths, i.e.
(axiom |∀x.list(x)= cons(x,nnil)|),
(axiom |∀x.list(x,y) = cons(x,list(y))|)
(axiom |∀x.list(x,y,z) = cons(x,list(y,z))|)?
∂06-Nov-81 1211 JMC
To: FFL
Dr. Blum's secretary called to remind you of 12:30 appointment at
Faculty Club with Dr. Blum today.
That's Elliott Bloom - 2 Ls, 2Ts and 2 Os.
∂06-Nov-81 1611 JMC shackleton
To: rah at S1-A, llw at S1-A
Would you like to get together some time this weekend?
I have the three more NASA reports I mentioned, and I suppose
you have had time to look at the ones you already have.
eco[f81,jmc] here contains notes on these papers, and I'll
try to ftp it to 1,jmc at s1.
I can come out there.
∂06-Nov-81 1851 JMC
To: danny at MIT-AI, minsky at MIT-AI
ECO[F81,JMC] summarizes three NASA reports.
∂06-Nov-81 2344 JMC slowness of page printer
To: RPG
A preliminary experiment indicates that it takes about half the computer
time for a process to output to E with your hack than it does to print
it on the page printer. If this is so, then the ancient page printer is
one of the main causes of slowness in the system. Do you have or can you
develop any info on this point?
∂06-Nov-81 2356 JMC
To: RPG
I was outputting to the file.
∂07-Nov-81 0040 JMC Make it Monday
To: llw at S1-A, rah at S1-A
(Tuesdays and Thursdays I teach). I'll come out for the day,
and we can talk when convenient to you.
∂08-Nov-81 0047 JMC
To: JK
Say again what files contains the description of the new rewrite, etc.
∂08-Nov-81 1740 JMC
To: JK
The proof is samele.prf[f81,jmc]. The proof name is samelength.
A decsimp resulted as follows:
(decsimp samelength#3#1#1 nil (10 9 lispax#24 lispax#20 6) nil
(lispax#12 lispax#23 lispax#19))
error in type calculation - tell jk
∂08-Nov-81 2311 JMC cellular automaton physics
To: minsky at MIT-AI
CC: ef at MIT-AI
An dimensional array of cells where the connections
are random rather than regular and such that the number of
cells at distance n increases as n↑3 might have
spherical symmetry in the large.
∂08-Nov-81 2339 JMC
To: minsky at MIT-AI, ef at MIT-AI
The real problem, however, is to approximate Lorentz invariance.
∂09-Nov-81 0005 JMC
To: FFL
dennet.xgp
∂09-Nov-81 0021 JMC writing a paper
To: RPG, ME
The two of you should write a short paper about running programs and the
system out of the editor. This should be the way all operating systems
should be controlled, but this fact is scarcely known. If necessary I'll
help with the advocacy part.
∂11-Nov-81 1126 JMC
To: csd.berlin at SU-SCORE
CC: csd.golub at SU-SCORE
I don't think the adversary attitude expressed in your November 11 message is
appropriate. Therefore, I will not look at the "course evaluations" you
send me, and I will not make time this quarter for "course evaluation".
∂11-Nov-81 1604 JMC Course Evaluations for Aut 1980
To: csd.golub at SU-SCORE
∂11-Nov-81 1114 Danny Berlin <CSD.BERLIN at SU-SCORE> Course Evaluations for Aut 1980
Date: 11 Nov 1981 1059-PST
From: Danny Berlin <CSD.BERLIN at SU-SCORE>
Subject: Course Evaluations for Aut 1980
To: csd.ydens at SU-SCORE, csd.dbrown at SU-SCORE, csd.yao at SU-SCORE,
csd.knuth at SU-SCORE, csd.schreiber at SU-SCORE, csd.karlb at SU-SCORE,
csd.schnepper at SU-SCORE, csd.buchanan at SU-SCORE,
csd.herriot at SU-SCORE, csd.manna at SU-SCORE, csl.bkr at SU-SCORE,
rwf at SU-AI, csd.siegel at SU-SCORE, csd.dietterich at SU-SCORE,
csd.jock at SU-SCORE, csd.haiman at SU-SCORE, csd.griffiths at SU-SCORE,
csd.oliger at SU-SCORE, csd.ullman at SU-SCORE, or.dantzig at SU-SCORE,
csl.lab.jfw at SU-SCORE, csd.mccarthy at SU-SCORE, csl.crc.ejm at SU-SCORE,
tob at SU-AI
cc: csd.trickey at SU-SCORE, jjw at SU-AI
Several suggestions have been made with regard to course evaluations.
The original forms and summaries will be sent to each teacher. Any teacher
disputing the accuracy of the summary should send me a message by Friday
Nov. 20. Also, any teacher that wishes to place a policy statement to reply
to comments in the summary should also submit it to me by that date. All
such statements will be published without editting (assuming abusive terms
are not used).
Finally, to save money only those professors specifically requesting a copy
of the entire book will receive one. Our default assumption is that each
teacher is primarilly concerned with the evaluation of their own course(s).
Danny Berlin
Course Evaluation Committee Etc.
-------
I don't think the adversary attitude expressed in your November 11 message is
appropriate. Therefore, I will not look at the "course evaluations" you
send me, and I will not make time this quarter for "course evaluation".
∂12-Nov-81 1503 JMC
To: konolige at SRI-AI
I'm rather tied up. How about tomorrow?
∂12-Nov-81 1516 JMC
To: konolige at SRI-AI
11-13 Konolige, 1:30pm
∂12-Nov-81 1725 JMC
To: FFL
I'll be in tomorrow afternoon.
∂13-Nov-81 1119 JMC
To: sharon.burks at CMU-10A
I will arrive Monday evening on Us AIR 841 from Akron at 6:50, and
I will leave on Tuesday evening on UA 823 to Los Angeles at 10:30pm.
I won't need hotel reservations as I will stay Monday night with
Ed Fredkin. I would like to talk to Allen Newell and Raj Reddy and
anyone else who wants to talk with me. I will be available all day
Tuesday from (say) 10am.
∂13-Nov-81 1124 JMC
To: kanerva at SUMEX-AIM
My impression is that the users of Foonlies are reasonably satisfied.
If their F4 (said to be equivalent to a KL) satisfies its first
customers, then I would consider them very price competitive. I wouldn't
presume that their maintenance (whatever they agree to contract for)
would be inadequate so close to their home base.
∂13-Nov-81 1518 JMC students from hp in Colorado
To: JMM
They are having some trouble in remote use of LOTS in finishing
the homework. Please be merciful. Name Steve Graham, John Romano,
Bill McDermott.
∂13-Nov-81 1636 JMC Reading Kurt Konolige's thesis
To: LGC at SU-AI
CC: konolige at SRI-AI
Are you willing to be a reader of Kurt Konolige's thesis? It concerns
the formalization of facts about knowledge. He can give you a pointer
to a press file containing his thesis proposal.
∂13-Nov-81 1751 JMC report
To: pourne at MIT-MC
CC: llw at S1-A, rah at S1-A
I think the phrase on page 2 of the summary "obviate the need for neutron
weapons in Europe" should be replaced by "give the President alternatives
to the use of nuclear weapons in Europe". The history of defense debates
is full of the use of hypothetical weapons systems to clobber existing
weapons systems or systems under development. The original phrase may
unnecessarily generate opposition from someone who would favor the kinetic
weapons but might fear that their advocacy would be used to prevent what
he believes to be necessary in the short term. Someone who wants to use
your proposal as a means of clobbering other proposals is a weak ally,
because he'll desert you as soon as his purpose is accomplished or shown
to be infeasible.
∂13-Nov-81 2022 JMC
To: FFL
mathem.>
∂14-Nov-81 0207 JMC
To: pourne at MIT-MC
RAH is indeed Rod Hyde. I don't know that whois works for non its sites.
What works from here is FINGER.
∂14-Nov-81 0211 JMC
To: pourne at MIT-MC
:finger rah@s1-a works at mc
∂15-Nov-81 0304 JMC
To: JMM
You haven't corrected your office or extension in your plan file.
∂15-Nov-81 1128 JMC
To: JMM
I'll be in shortly after noon.
∂15-Nov-81 1129 JMC
To: FFL
Please if you can find curriculum vitae of Antonio Porto on my desk.
∂15-Nov-81 1248 JMC
To: JMM
The midterm is in your desk.
∂18-Nov-81 2052 JMC
To: csd.golub at SU-SCORE
Even before I got this message, I was about to advocate asking Carolyn
Talcott to serve on the MTC-qual committee. She has taken the exam
(as given by Zohar and Jim Morris) and passed outstandingly, and she
knows as much of the literature in MTC (the verification part) as anyone.
∂15-Nov-81 2014 WOL Message from Zohar Manna
John:
I talked to Zohar on the phone today (he is in Israel) and he asked me to
send you the two following messages:
(1) Zohar will probably not be here in December as he had previously planned.
He will thus not be able to be on the MTC-qual committee.
(2) He met Ehud Shapiro and was quite impressed with him. If you are still
considering him his recommendation is favorable.
Pierre Wolper
∂18-Nov-81 2109 JMC
To: csd.golub at SU-SCORE
Yes, I'm still interested in him.
∂18-Nov-81 2148 JMC
To: gs70 at CMU-10A
bfloat[f81,jmc] comments on big floats for common lisp
LISP already does computation with large integers beter than
many languages intended for numerical computation. I think Common
LISP should be able to handle multiple precision floating point
numbers in a better way than Algol, Fortran, Pascal, etc.
The idea is to handle precision dynamically rather than at
compile time. Each big floating number has encapsulated with it an
integer giving its "precision" in bits. There is a function
(PREC X)
whose value is the precision of X and a function
(SETPREC X N)
whose value is that of X, but whose precision is extended or truncated to
the smallest convenient integer greater than or equal to N. We propose that
SETPREC be non-destructive, so that the original value still remains unless
something like (SETQ X (SETPREC X N)) were done. We say the next convenient
size number, since an integer number of words will actually be used in
an implementation. However, subroutines can use the nominal precision
to decide how many iterations to do or how many terms of an expansion to
use. Conversions to other machines can also be based on the nominal precision.
The operations on big floats should not attempt to guarantee
that the nominal precision corresponds to the accuracy of the numbers.
This probably cannot be done in a uniform way that is suitable for
all numerical purposes. For example, we might standardize the precision
of a sum as the lesser of the precisions of the summands even though
adding -1.95 to 2.00 loses accuracy. Programmers wishing an estimate
of accuracy would further encapsulate the bigfloats with their own
accuracy measures and would define operations that output accuracies
as well as values according to whatever scheme they preferred.
The Common LISP bigfloats with their nominal precisions will be a
useful tool for such tasks.
Some users may fool themselves and others by confusing
precision and accuracy and increasing the precisions of their
numbers without justification. As Larry Niven and Jerry Pournelle
would say, "Think of it as evolution in action".
∂20-Nov-81 0057 JMC
To: LLW at SU-AI
See submar.ns[1,jmc] at S1.
∂20-Nov-81 1139 JMC
To: pourne at MIT-MC
I liked "Oath of Fealty", and I thought the legal part - the
probable legal consequences of killing the pranksters - was the
most plausible I have read. Usually the heroes casually kill off
the bad guys with no legal consequences at all.
Two small points.
1. Hydrogen is no more dangerous than natural gas, except for a
somewhat greater tendency to leak. However, it might not be a good
idea to keep the power plant in the residential building. This is
a defect in the all-encompassing arcology idea. Perhaps a nuclear
power plant would be safer than one using combustible fuel.
2. The youth of the arcology in so far as they go to school or college
with other youth are subject to the same ideological influences.
Such influences are often very effective even when they directly
contradict everyday experience. Someone commented recently on
the communist slogans painted on buildings in West Berlin within
sight of the Berlin Wall. Therefore, one would expect some "ecology"
movement within the arcology. This is in addition to an expected
tendency for many young people to want to move out.
∂21-Nov-81 1259 JMC
To: "@SHACKL.LIS[F81,JMC]" at SU-AI
ONEILL[F81,JMC] here or ONEILL[SHA,JMC] at S1 reports a lunch with him.
∂21-Nov-81 1525 JMC
To: JK
CC: RWW, CLT, JJW
I have been having trouble remembering all the syntax of
declarations in EKL (I had problems in FOL, too.), and this has
led me to a new idea about how it should be done.
Namely, declarations should have the same format as other
assertions, i.e. predicates applied to the names of the identifiers.
This means that an identifier may have different aspects declared
in different statements. Thus we might write in declaring the
identifier * to represent the LISP function APPEND:
(functional '*)
(EQUAL (ARITY '*) 2)
(EQUAL (DOMAIN '*) LISTS))
(INFIX '*)
(EQUAL (PRECEDENCE '*) 850)
Remarks: The object is to achieve greater modularity and to try to
put declarations on the same basis as other assertions. Done as
crudely as in the above example, the amount of writing required
increases over the present "optimized" notation. However, the
ways of allowing a user to give information to the machine
compactly should be general. Thus suppose the above-mentioned
properties weren't involved in specifying a language but were
assertions about some object in the world, the same tensions between
using a modular notation and a compact one exist.
An alternative to the above use of ' is to use a system more like
that of MACLISP and LISP machine LISP with more elaborate conventions
about when things are normally taken as quoted and other things
have to be explicitly unquoted.
∂21-Nov-81 1755 JMC
To: REG
sail[f81,jmc] The finances of SAIL
To: whom it concerns
Facts:
1. The marginal cost of running SAIL is about $200K per year.
2. This can be reduced by reducing personnel.
3. SAIL's share of the present CSCF budget is close to $400K per year.
4. The present SAIL users don't have $400K per year but they do have
more than $200K to spend for computing.
5. SAIL is not very heavily loaded and could take more users if the
increased crowding were seen to be worthwhile in order to keep costs
down. Of course, SAIL is slow in the middle of the afternoon, but
I have found that one can not only edit effectively but can run many
large programs like EKL and can also debug small LISP programs.
At other hours SAIL is quite unloaded. Of course, people doing AI
will always push their computer facilities to the limit and want
more. Nevertheless, given the present balance between cost and
performance, SAIL isn't heavily loaded.
6. Because of its non-standard software, SAIL is seen as less desirable
than SCORE by new users. Many old users prefer the features of SAIL.
7. If SAIL could be replaced by a 2060 with similar
memory, disk storage and terminal capacity today without cost, this
might be the right thing to do in spite of the loss of features.
However, this replacement could not be done for less than a million
dollars.
8. SAIL is a software dead end in spite of the fact that its software
has many features more advanced than exists elsewhere. Because these
features were not written up, the world has moved in other directions.
The department needs to determine how these features, line-editor and
more recently operating out of E, efficient display and real-time service,
and enlarged character set can be obtained in its new machines.
9. Closing down SAIL is not a reasonable option until the 2080 or
S-1 becomes available to give several times the performance at a
cost comparable to the present cost of replacing SAIL by a 2060.
This will be at least two or three years depending on when these
things become available and the time it takes the Computer Science
Department to get the money.
10. The present formula for allocating charges won't work, because
SAIL users don't have the money to pay their allocated share. It
is also somewhat unfair, since most of SAIL's allocated share of
the general expenses are going to pay for new developments only
a small part of which directly benefit SAIL users.
11. CSCF should allocate charges so that SAIL pays for itself. Lower
charges on SAIL are probably needed in order that new users feel
compensated for learning its non-standard features.
12. There are some genuine choices that can be made concerning what
efforts should be made to get more business for SAIL. In the first
place, maybe this is unncessary. Since present usage will pay for
more than operating costs, a rate can be found that makes SAIL pay
for itself. If this rate is less than that charged by SCORE, some
usage will migrate. (I am assuming the correctness of Ralph's
assertion that SCORE can sell all the aliquots it has). On the other
hand, I have had no difficulty in attracting mathematicians
and philosophers with whom I have had personal contact, and they
continue to find SAIL cost-effective for their purposes without any
further assistance from me and perhaps from anyone else.
Probably the smallest sales campaign would attract people who have
been convinced by the CONTEXT sales campaign but can't afford the
CONTEXT rates.
There is one software modification that would make this more attractive.
Namely, if a version of E were made to work with Zenith, etc. terminals
or if EMAX were made available, then users who can't afford terminals
with the SAIL character set could work effectively. Perhaps they
already can, and the fact needs only to be properly documented.
The considerations determining this choice should be
(1) Do we need more users to be sure that SAIL can pay its operating costs?
(2) Assuming we don't actually need more users, do we want more users
anyway, so we can help pay for the Ethernet development costs and
perhaps some of the File Computer development costs?
This is a matter for the Department to decide after consultation
with all interested parties including SAIL users and the CSCF
managers.
∂23-Nov-81 0110 JMC Turing award for Boyer and Moore
To: atp.bled at UTEXAS-20
I think their book "A Computational Logic" is sufficient evidence
that they merit such an award. What do you think about jointly preparing
a nomination or recommendation or memorandum to whoever is in charge
of it?
∂23-Nov-81 0113 JMC Turing award for Boyer and Moore
To: atp.bledsoe at UTEXAS-20
I think their book "A Computational Logic" is sufficient evidence
that they merit such an award. What do you think about jointly preparing
a nomination or recommendation or memorandum to whoever is in charge
of such matters at ACM?
∂24-Nov-81 1629 JMC
To: taw at S1-A
I'm sorry, but my memory of where I got it must be playing tricks on me,
because I think I got it at S-1, possibly from Lowell or possibly even
from a bulletin board there. The copy I put on the bulletin board here
seems to have been taken down.
∂24-Nov-81 1931 JMC
To: minsky at MIT-AI
New Yorker
A Sarah Lipincott from the New Yorker called to read me parts of
the profile of you that mentioned me. She said you said that I got the
idea of a language combining list structure from IPL with Fortran like
algebraic statements from Gelernter's FLPL. The reverse is true. When
Rochester decided to implement your idea of a plane geometry theorem
prover, I was already a consultant to his Department when he assigned
the job of doing the geometry program to Gelernter, a new PhD in physics,
who had just been hired by IBM. As a consultant, I suggested combining
the ideas of Fortran with those of IPL, but I had already worked out CAR and
CDR at Dartmouth.
Their major contribution to the ideas behind LISP was to make CONS,
which I suggested and which was based on IPL, a function whose value was
the location of the register used. I had imagined it to be a subroutine
which didn't return a value. This improvement was decisive, because it
permitted CONSes to be composed and made a proper algebraic structure.
However, they didn't know about conditional
expressions and resisted the idea of recursion.
FLPL was never used or even proposed for any purpose but the
geometry program, so far as I know, although they did write a separate
paper about it.
I was surprised that you thought I got the idea from them rather
than the other way around, but now I remember that we weren't in contact
when I was working on CAR and CDR. I suppose you were still at Tufts.
∂25-Nov-81 0250 JMC
To: hdt at MIT-AI
Your request seems bizarre.
∂25-Nov-81 1048 JMC
To: CLT
Bonell found a bad starter relay. He'll replace it this afternoon.
∂25-Nov-81 1222 JMC
To: REG
There should be a several year projection of computer charges for proposals.
∂25-Nov-81 1308 JMC PI
To: TOB
Betty Scott has agreed to prepare a letter requesting that you replace
me as PI on your grants and contracts.
∂26-Nov-81 0024 JMC
To: RWW
Thanks. We'll be there.
∂28-Nov-81 2251 JMC
To: FFL
analog.xgp
∂30-Nov-81 1833 JMC
To: FFL
If Greenspan calls while I'm out, the answer is that I haven't time
to speak in Buffalo.
∂30-Nov-81 2356 JMC thesis proposal
To: konolige at SRI-AI
The current version is very much better. I think I understand
almost all of it, and, unless one of the other readers has problems, it
just needs to clarify two points to be acceptable.
I still need to be sure what "Quine's representation problems"
are; are they just the sentences about Ortcutt, etc. that I treat in my
concepts paper or does this refer to something more technical? Also, what
is "belief recursion"? If that isn't a standard term that I have missed,
a sentence or two saying what you mean would be helpful. Otherwise, a
reference would help.
∂01-Dec-81 0138 JMC
To: FFL
hurd.1
∂01-Dec-81 0144 JMC not all consequences
To: konolige at SRI-AI
It doesn't have to be spelled out in the thesis proposal, but if
knowledge isn't closed under consequence, then it is important
to decide and say what consequences are included. I have never
been able to reach a definite proposal for this.
∂01-Dec-81 0316 JMC meeting
To: csd.ullman at SU-SCORE
Sorry I forgot about it. You're right that I don't like the idea
of postponing the file computer. We will need it as soon as possible
in order to get it programmed. I don't care whether an S-1 or
a 2080 is the place holder for the fast time-sharer. Bob Englemore
says he has all he needs from me for the proposal. Oh, I'd better
check that he has what he needs about the file server as well as about
the needs of formal reasoning. However, Bob Kahn apparently didn't
question the need for a file server. Or did he?
∂01-Dec-81 0356 JMC
To: FFL
Try analog.xgp again. I pubbed an older letter.
∂01-Dec-81 1454 JMC Selling Perseus computer time
To: REG at SU-AI
CC: RWW at SU-AI, csd.golub at SU-SCORE
In my opinion, it will be to the advantage of the Computer Science
Department to sell Perseus computer time on SAIL, because this will make
the SEUS system available for experimentation within the Department.
∂01-Dec-81 1522 JMC Perseus
To: csd.golub at SU-SCORE
CC: RWW at SU-AI
It is Weyhrauch's company that developed a LISP variant called SEUS
under contract to H-P. It has been using outside computer time, but
there seem to be mutual advantages in their using SAIL.
∂03-Dec-81 1143 JMC
To: LGC
250 is ok. Tell Lynn Gotelli.
∂04-Dec-81 1800 JMC
To: CG
The custom is to arrive at 9am and schedule the quals for that day.
It takes about an hour and a half per student. How long it takes
depends on the ratio of examinees to examiners.
∂05-Dec-81 0048 JMC
To: ROY
The Imlac needs to have its timing readjusted again.
∂05-Dec-81 2011 JMC
To: csd.mcgrath at SU-SCORE
We missed you Friday.
∂06-Dec-81 0242 JMC
To: FFL
Please print a copy of KEYBOA.PRE[W81,JMC] and give it to Don Knuth.
∂06-Dec-81 1401 JMC
To: FFL
Please send for this.
The "Energy Data Sheet" available free from Access to Energy,
Box 2298, Boulder, CO 80306 (stamped, self-addressed envelope) is
∂06-Dec-81 2153 JMC Brown thumb
To: CL.MOORE at UTEXAS-20, CL.BOYER at UTEXAS-20
CC: CLT at SU-AI
Exercising my well-known brown thumb, I got Carolyn to try
(EQUAL (AP U (AP V U)) (AP (AP U V) U))
where AP had the usual definition of APPEND. As I feared,
your prover failed and eventually gave up. The results
are given in AP[F81,JMC]@SU-AI.
∂06-Dec-81 2209 JMC more on brown thumb
To: cl.boyer at UTEXAS-20, cl.moore at UTEXAS-20, CLT at SU-AI
I note that the conclusion of formula 1.1.3 is never true. Can this
happen naturally, or does it indicate a bug?
∂07-Dec-81 1133 JMC
To: JPM
The Stanford SE2 chapter, by inclination of its members rather than
principle, has tended to undertake projects of national interest,
such as our conferences on waste disposal and what to do in case of
an oil cut-off. Our probable current project is a California energy
recovery plan" based on the idea that the next governor, whether
Democrat or Republican, is likely to be better on energy than Brown.
A preliminary version of the ideas, not looked at by anyone else yet,
is in CERP[F81,JMC]. Why don't you look at it, and then we can
discuss it. It looks like Miro Todorovich, the national chairman,
will be able to find some money to pay someone, probabaly Alan
Pasternak (former State Energy Commissioner) to work out details.
∂07-Dec-81 2312 JMC
To: YM
CC: CG
∂07-Dec-81 1946 YM MTC Quals
To: JMC
CC: YM
Hello,
Is it already known who will be in the committee of the MTC Quals?
When will the schedule be known?
Thanks, Yoni Malachi.
Chris Goad has agreed to make a schedule.
∂07-Dec-81 2324 JMC dinner invitation
To: CLT
Tom Binford invites us for the 20th to celebrate his appointment as
Adjunct Professor.
∂08-Dec-81 1744 JMC
To: FFL
I know nothing about cs320 and cs370.
∂08-Dec-81 1745 JMC
To: CG
OK, ship it.
∂08-Dec-81 1746 JMC
To: JDH
Glad you're making progress. I'll give you a continuation grade. When the
program is working will come the task of writing up the heuristics
informatively.
∂09-Dec-81 0120 JMC
To: pourne at MIT-MC
CC: llw at S1-A
Jerry:
I don't see that announcing Shackleton is urgent. We are
proceeding with planning though perhaps too slowly. We can give
ourselves even another year provided we believe we are spending
it effectively. However, should our private planning relapse into
inactivity, then it is our obligation to put the idea into the
public domain. The planning done so far will help that should we
decide that our interests are too diverse to concentrate on
Shackleton.
I'm all for an L-5 Project Luna, although I'm not one of
those academics in a position to assign such things as class
projects. Incidentally, I had lunch with O'Neill recently. His
ideas are still too grandiose in my opinion, but the two practical
projects he is doing, redesigning his lunar mass launcher and
getting some experiments started on processing lunar materials,
are both worthwhile and will help any future efforts.
- John
∂09-Dec-81 0128 JMC
To: pourne at MIT-MC
Two further points.
1. Lowell's S-1 project at Livermore now has its own ARPAnet
connection, so he is best addressed as LLW@S1. However, mail addressed
to him here is automatically forwarded, so nothing is lost.
2. I have been thinking further about the desirability of
a popular book on surviving nuclear war. I have some notes called
SURVIV[F81,JMC], but I have three books to read that I hope will
make some matters more clear, and therefore it might be better to
wait till I mail you something.
I have been set off by the recent propaganda blasts by
"Physicians for Social Responsibility", and I think one can write
a book that avoids the Civil Defense manual approach and also the
"every man for himself" approach. I hope for your participation
in this project or at least advice.
∂10-Dec-81 1206 JMC
To: mas at S1-A
The final is final.f81[f81,jmc]
∂10-Dec-81 1454 JMC message from John Cocke
To: pmf at S1-A
He wants to invite you to give a talk at Yorktown emphasizing
floating point. We are having dinner tonight here.
∂10-Dec-81 1508 JMC
To: pmf at S1-A
He'll phone you from there.
∂10-Dec-81 1523 JMC
To: pmf at S1-A
By there, I meant Yorktown.
∂10-Dec-81 2221 JMC
To: CLT
Your mother called. Your cousin Nina has broken her hip. Call your mother.
∂11-Dec-81 0236 JMC
To: rem at MIT-MC
I would like to understand a bit more about your algorithm.
Questions:
1. How is the permutation group presented? By generators presented as
products of cycles?
2. What is the form of a "diagaonalized" permutation group?
∂11-Dec-81 0248 JMC
To: rem at MIT-MC
I understand the answer to the first question but not the second. Could
you give an example of a diagonalization?
∂11-Dec-81 0325 JMC
To: rem at MIT-MC
I see how it works for the full symmetric group, and I tried it for
the Klein Vierergruppe consisting of (1), (1 2)(3 4), (1 3)(2 4) and
(1 4)(2 3). It was possible to fill in the first row of the table
but no more, since every permutation that keeps 1 fixed also keeps
the others fixed. The group generated by (1 2 3 4) was equally trivial.
What's the first non-trivial example? Are the alternating groups on
four and five letters good examples?
∂11-Dec-81 0439 JMC
To: rem at MIT-MC
Thanks.
∂13-Dec-81 2201 JMC
To: FFL
Please inSCRIBE the file CERP[F81,JMC].
∂15-Dec-81 0009 JMC
To: csd.golub at SU-SCORE
Let me mention that a discussion of "property rights in CIS" is for
me a strong incentive to not come.
∂15-Dec-81 0347 JMC
To: CLT
That was the very best fruit Jello I've ever eaten.
∂16-Dec-81 1313 JMC
To: DEK
Here's a MACLISP program for shuffling that seems different from those
in volumes 2 and 3. If you don't read LISP and want an further explanation,
it will be cheerfully supplied.
;;; Shuffles a list in random order by assigning each element randomly to
;;; one of two output lists w1 and w2 and then appending the results
;;; of shuffling w1 and w2. It assigns equal probability to each of
;;; the n! permutations of u. It only terminates with probability one,
;;; since if the random number generator gave always 0 or always 1 it
;;; wouldn't terminate.
(defun shuffle (u)
(if (or (null u) (null (cdr u)))
u
(shuffle1 u nil nil)))
(defun shuffle1 (u w1 w2)
(if (null u)
(append (shuffle w1) (shuffle w2))
(= 0 (random 2))
(shuffle1 (cdr u) (cons (car u) w1) w2)
(shuffle1 (cdr u) w1 (cons (car u) w2))
))
∂16-Dec-81 1517 JMC
To: pourne at MIT-MC
I will be in L.A. Friday. Are you available Friday eve or Sat. am?
∂17-Dec-81 1640 JMC
To: CLT
∂17-Dec-81 1429 MAS
To: "@TOM.DIS[1,MAS]" at SU-AI
The dinner party will not be at Tom's house. It will be at:
580 Arastradero Road, The Penthouse (PH on elevator)
1/2 block from El Camino toward Foothill on the right.
Park in the street. Sunday at 6 PM.
∂18-Dec-81 0728 JMC
To: FFL
I have gone to L.A. to III meeting
∂19-Dec-81 1611 JMC
To: FFL
Please send Pournelle Short Waits add Essential E.
∂19-Dec-81 1816 JMC
To: pournelle at MIT-MC
Have you ever considered buying an abandoned mine?
∂20-Dec-81 0032 JMC
To: JMM
How are you coming with the exams? I can work today (Sunday).
∂20-Dec-81 0033 JMC
To: FFL
Please campus mail cerp.pre[f81,jmc] to Elliott Bloom at SLAC.
∂20-Dec-81 1407 JMC
To: RWW
She's in Martinez with sick cousin. She may be back today but more likely
tomorrow.
∂23-Dec-81 0047 JMC
To: CLT
Consider test2[f81,jmc]. The induction scheme proposed seems unpromising.
∂23-Dec-81 1806 JMC
To: TW
Comp. meeting time is ok.
∂24-Dec-81 0110 JMC
To: csd.golub at SU-SCORE
No interest Tang Pengfei.
∂25-Dec-81 1353 JMC
To: FFL
murray.2
∂25-Dec-81 1639 JMC
To: FFL
waltz.1
∂28-Dec-81 1621 JMC
Clara Torda is retired from some New York academic institution. She asked
permission to audit CS206 in Fall 1980 and CS226 in Winter 1981. Her
login QCT is left over from then. I have no idea who pays for her
computer time. It's not me, and I hope it's not you. She has a book on
memory and the brain which I'll be glad to lend you if you want to take
the trouble to look at it. Is she a problem?
∂28-Dec-81 1624 JMC
To: TOB
Clara Torda is retired from some New York academic institution. She asked
permission to audit CS206 in Fall 1980 and CS226 in Winter 1981. Her
login QCT is left over from then. I have no idea who pays for her
computer time. It's not me, and I hope it's not you. She has a book on
memory and the brain which I'll be glad to lend you if you want to take
the trouble to look at it. Is she a problem? How come you ask me?
∂28-Dec-81 1701 JMC
To: FFL
The name is GABOR BELOVARI, Dept. of Mathematical Sciences, Kent State, Kent,
Ohio 44242.
Please send a note to Prof. Ursula Maydell, Computer Science Dept.
University of Alberta, Edmonton, Albert, CANADA with Belovari's name
and address. If he sent me a curriculum vitae, send a copy of that
too.
∂28-Dec-81 1921 JMC
To: TOB
I think the paper should be judged on its merits independently of its
source.
∂29-Dec-81 2336 JMC
To: mas at S1-A
CC: JMM at SU-AI
As I remember, you weren't on the list of those to whom I was supposed
to give grades. Jitendra will check what we are supposed to have done.
The material exists to give a grade, however.
∂30-Dec-81 1519 JMC CS206 student
To: JMM
Bill McDermott from H-P Colorado called. He was on vacation and is
just starting on final. He wanted to know how he was doing so far, and
I couldn't find any record. I also told him we would keep is LOTS account
alive for two weeks into January for him to finish the EKL assignment.
∂30-Dec-81 1523 JMC
To: JMM
This also requires keeping EKL alive at LOTS a bit longer.
∂30-Dec-81 1524 JMC
To: FFL
Please update porto.1[let,jmc] to correspond to current letter.
∂31-Dec-81 1402 JMC
To: FFL
merrym.1
∂31-Dec-81 1559 JMC grade
To: mas at S1-A
CC: JMM at SU-AI
I have just received the grade sheets for NRO students. A grade will
follow in due course.
∂01-Jan-82 0023 JMC
To: FFL
kline.1
∂01-Jan-82 1535 JMC
To: RWW
Prof. Satoru Takasu
Research Institute of Mathematical Sciences
Kyoto University
Kyoto, JAPAN
Prof. Shigeru Igarashi
Computer Science Department
Tsukuba University
Tsukuba, JAPAN
∂01-Jan-82 1921 JMC
To: FFL
See what you think of FILRUL[1,JMC]. It concerns improving my files.
∂02-Jan-82 2114 JMC
To: CLT
Guess who used the minimization schema in a proof of correctness of samefringe.
∂03-Jan-82 0033 JMC your paper "The proper place of men and machines ... "
To: kay at PARC-MAXC
I liked your paper. Let me point out that much can be done to aid a person
who wants to read text in a foreign language which he knows imperfectly.
We obviously have the on-line dictionary, but imperfect machine translation
can also suggest readings and identify known idioms. Is anything being done
to realize your idea?
∂03-Jan-82 1525 JMC
To: RWG
See life[f81,jmc].
∂03-Jan-82 1708 JMC
To: RWW
A stragedy is a strategy that doesn't work too well.
∂04-Jan-82 1209 JMC
To: FFL
No need for letter to Russell; we discussed the matter on the phone.